/**
 * 
 */
package niuke.Wannafly;

import java.util.Scanner;

/**
 * @author zhongfang
 *
 */
public class test2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();// 档位数
		int m = sc.nextInt();// B速度
		double k = sc.nextInt();// 距离
		int max = Integer.MIN_VALUE;
		int min = Integer.MAX_VALUE;
		for (int i = 0; i < n; i++) {
			int a = sc.nextInt();
			max = Math.max(max, a);
			min = Math.min(min, a);
		}
		sc.close();
		k = k * 36 / 10;
		double t1, t2;
		if (n != 0) {
			t1 = k / (m + max);
			t2 = k / (m + min);
		} else {
			t1 = t2 = k / m;
		}
		System.out.println((long) Math.ceil(t1) + " " + (long) Math.ceil(t2));

	}

}
